نتایج جستجو برای: Capacitated p-hub centre system
تعداد نتایج: 3429803 فیلتر نتایج به سال:
in this paper, a robust model presented is developed for hub covering flow problem in which hubs have capacity. this problem has two objective functions converting to a single-objective problem by using weighting method. firstly, the problem will be formulated in a certain case. then, by considering the demand as a non-random variable, it will be modeled by robust optimization. finally, by usin...
in this paper, a hierarchical p-hub median problem is considered that all the nodes and arcs on the network have limited capacities. proposed model has three-level where the complete network at the top level consists of the central hubs. the second and third levels consist of hub and demand nodes respectively, which are connected through star networks. also, delivery time restriction is taken i...
The hierarchical hub covering facility location problems are applied to distribution systems, transportation, waste disposal, treatment services, emergency services and remote communication. The problems attempt to determine the location of service providers' facilities at different levels and specify their linking directions in order to reduce costs and to establish an appropriate condition in...
In this paper we consider a capacitated single allocation p-hub median problem with multiple capacity levels (CSApHMPMC) in which the decisions are to determine the location of p hubs and their capacity levels, the single allocation of non-hub nodes to hubs in the logistics network. This problem is formulated as an integer programming model with the objective of minimizing the sum of total tran...
In this paper we consider a capacitated single allocation p-hub median problem (CSApHMP) which is to determine the location of p hubs, the allocation of non-hub nodes to hubs in the logistics network. This problem is formulated as an integer programming model with the objective of minimizing the sum of total transportation cost and fixed cost of the selected p hubs. Since the CSApHMP is NP-hard...
The goals of hub location problems are finding the location of hub facilities and determining the allocation of non-hub nodes to these located hubs. In this work, we discuss the multi-modal single allocation capacitated p-hub covering problem over fully interconnected hub networks. Therefore, we provide a formulation to this end. The purpose of our model is to find the location of hubs and the ...
the existing works considering the flow-based discount factor in the hub and spoke problems, assume that increasing the amount of flow passing through each edge of network continuously decreases the unit flow transportation cost. although a higher volume of flow allows for using wider links and consequently cheaper transportation, but the unit of flow enjoys more discounts, quite like replacing...
hub covering location problem, network design, single machine scheduling, genetic algorithm, shuffled frog leaping algorithm hub location problems (hlp) are synthetic optimization problems that appears in telecommunication and transportation networks where nodes send and receive commodities (i.e., data transmissions, passengers transportation, express packages, postal deliveries, etc.) th...
In this paper, we present a new formulation of one-stop capacitated hub-and-spoke model as a natural extension of the uncapacitated one-stop model. The model involves arc capacity constraints as well as hub capacity constraints, which enables us to incorporate some practical factors into the model. We also present a branch-and-bound based exact solution method with Lagrangian relaxation boundin...
Hub covering location problem, Network design, Single machine scheduling, Genetic algorithm, Shuffled frog leaping algorithm Hub location problems (HLP) are synthetic optimization problems that appears in telecommunication and transportation networks where nodes send and receive commodities (i.e., data transmissions, passengers transportation, express packages, postal deliveries, etc....
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید